for i in range(int(input())):
n, a, b = map(int, input().split())
if b >= a:
print(str((n+a-1)//a))
continue
print('1')#include <bits/stdc++.h>
using namespace std;
int main ()
{
int t;
cin >> t;
while(t--){
long long n , a , b;
cin >> n >> a >> b;
long long ans = 0;
if(n <= a || a>b){
ans = 1;
}
else{
ans = ceil( double(n)/double(a) );
}
cout << ans << endl;
}
return 0;
}
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |
Factorial equations | Removal of vertices |
Happy segments | Cyclic shifts |
Zoos | Build a graph |
Almost correct bracket sequence | Count of integers |